Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar14/TRCSRSLASHEx1_Luc02b

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, n__from₁(s₁(X)))
first₂(0, Z) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
sel₂(0, cons₂(X, Z)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
from₁(X) -> n__from₁(X)
first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__from₁(X)) -> from₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(X1, X2)
activate₁(X) -> X

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, n__from₁(s₁(X)))
first₂(0, Z) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
sel₂(0, cons₂(X, Z)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
from₁(X) -> n__from₁(X)
first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__from₁(X)) -> from₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(X1, X2)
activate₁(X) -> X

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

SEL₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
SEL₂(s₁(X), cons₂(Y, Z)) -> SEL₂(X, activate₁(Z))
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(X1, X2)
ACTIVATE₁(n__from₁(X)) -> FROM₁(X)
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, n__from₁(s₁(X)))
first₂(0, Z) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
sel₂(0, cons₂(X, Z)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
from₁(X) -> n__from₁(X)
first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__from₁(X)) -> from₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(X1, X2)
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

SEL₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
SEL₂(s₁(X), cons₂(Y, Z)) -> SEL₂(X, activate₁(Z))
ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(X1, X2)
ACTIVATE₁(n__from₁(X)) -> FROM₁(X)
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, n__from₁(s₁(X)))
first₂(0, Z) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
sel₂(0, cons₂(X, Z)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
from₁(X) -> n__from₁(X)
first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__from₁(X)) -> from₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(X1, X2)
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(X1, X2)
FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, n__from₁(s₁(X)))
first₂(0, Z) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
sel₂(0, cons₂(X, Z)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
from₁(X) -> n__from₁(X)
first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__from₁(X)) -> from₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(X1, X2)
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVATE₁(n__first₂(X1, X2)) -> FIRST₂(X1, X2)

The remaining pairs can at least by weakly be oriented.

FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

Used ordering: Combined order from the following AFS and order.
ACTIVATE₁(x1) = ACTIVATE₁(x1)
n__first₂(x1, x2) = n__first₂(x1, x2)
FIRST₂(x1, x2) = FIRST₁(x2)
s₁(x1) = s
cons₂(x1, x2) = x2

Lexicographic Path Order [19].
Precedence:

s > [ACTIVATE₁, n_{_first₂}, FIRST_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FIRST₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, n__from₁(s₁(X)))
first₂(0, Z) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
sel₂(0, cons₂(X, Z)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
from₁(X) -> n__from₁(X)
first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__from₁(X)) -> from₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(X1, X2)
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

SEL₂(s₁(X), cons₂(Y, Z)) -> SEL₂(X, activate₁(Z))

The TRS R consists of the following rules:

from₁(X) -> cons₂(X, n__from₁(s₁(X)))
first₂(0, Z) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
sel₂(0, cons₂(X, Z)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
from₁(X) -> n__from₁(X)
first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__from₁(X)) -> from₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(X1, X2)
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

SEL₂(s₁(X), cons₂(Y, Z)) -> SEL₂(X, activate₁(Z))

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
SEL₂(x1, x2) = SEL₁(x1)
s₁(x1) = s₁(x1)
cons₂(x1, x2) = cons₂(x1, x2)
activate₁(x1) = activate
first₂(x1, x2) = x2
n__first₂(x1, x2) = x2
n__from₁(x1) = n__from
from₁(x1) = from₁(x1)
0 = 0
nil = nil

Lexicographic Path Order [19].
Precedence:

[s₁, cons_2] > SEL₁ > from₁
[s₁, cons_2] > activate > from₁
n_{_from} > from₁
0 > from₁
nil > from₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

from₁(X) -> cons₂(X, n__from₁(s₁(X)))
first₂(0, Z) -> nil
first₂(s₁(X), cons₂(Y, Z)) -> cons₂(Y, n__first₂(X, activate₁(Z)))
sel₂(0, cons₂(X, Z)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
from₁(X) -> n__from₁(X)
first₂(X1, X2) -> n__first₂(X1, X2)
activate₁(n__from₁(X)) -> from₁(X)
activate₁(n__first₂(X1, X2)) -> first₂(X1, X2)
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.